Policy Analytics Generation Using Action Probabilistic Logic Programs

نویسندگان

  • Gerardo I. Simari
  • John P. Dickerson
  • Amy Sliva
چکیده

Action probabilistic logic programs (ap-programs for short) [15] are a class of the extensively studied family of probabilistic logic programs [14,21,22]. ap-programs have been used extensively to model and reason about the behavior of groups and an application for reasoning about terror groups based on ap-programs has users from over 12 US government entities [10]. ap-programs use a two sorted logic where there are “state” predicate symbols and “action” predicate symbols1 and can be used to represent behaviors of arbitrary entities (ranging from users of web sites to institutional investors in the finance sector to corporate behavior) because they

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling Markov Decision Processes with Imprecise Probabilities Using Probabilistic Logic Programming

We study languages that specify Markov Decision Processes with Imprecise Probabilities (MDPIPs) by mixing probabilities and logic programming. We propose a novel language that can capture MDPIPs and Markov Decision Processes with Set-valued Transitions (MDPSTs); we then obtain the complexity of one-step inference for the resulting MDPIPs and MDPSTs. We also present results of independent intere...

متن کامل

Reasoning about Policies using Logic Programs

We use a simplified version of the Policy Description Language 3)2)£ introduced in (Lobo, Bhatia, & Naqvi 1999) to represent and reason about policies. In 3)2)£ a policy description is a collection of Event-ConditionAction-Rules that defines a mapping from event histories into action histories. In this paper we introduce the generation problem: finding an event history that generates a given ac...

متن کامل

Reinforcement Learning in Partially Observable Markov Decision Processes using Hybrid Probabilistic Logic Programs

We present a probabilistic logic programming framework to reinforcement learning, by integrating reinforcement learning, in POMDP environments, with normal hybrid probabilistic logic programs with probabilistic answer set semantics, that is capable of representing domain-specific knowledge. We formally prove the correctness of our approach. We show that the complexity of finding a policy for a ...

متن کامل

Access and Mobility Policy Control at the Network Edge

The fifth generation (5G) system architecture is defined as service-based and the core network functions are described as sets of services accessible through application programming interfaces (API). One of the components of 5G is Multi-access Edge Computing (MEC) which provides the open access to radio network functions through API. Using the mobile edge API third party analytics applications ...

متن کامل

Multi-Objective Policy Generation for Mobile Robots under Probabilistic Time-Bounded Guarantees

We present a methodology for the generation of mobile robot controllers which offer probabilistic time-bounded guarantees on successful task completion, whilst also trying to satisfy soft goals. The approach is based on a stochastic model of the robot’s environment and action execution times, a set of soft goals, and a formal task specification in co-safe linear temporal logic, which are analys...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012